IPOG/IPOG-D: efficient test generation for multi-way combinatorial testing
نویسندگان
چکیده
This paper presents two strategies for multi-way testing (i.e. t-way testing with t>2). The first strategy generalizes an existing strategy, called in-parameter-order, from pairwise testing to multi-way testing. This strategy requires all multi-way combinations to be explicitly enumerated. When the number of multi-way combinations is large, however, explicit enumeration can be prohibitive in terms of both the space for storing these combinations and the time needed to enumerate them. To alleviate this problem, the second strategy combines the first strategy with a recursive construction procedure to reduce the number of multi-way combinations that have to be enumerated. Both strategies are deterministic, i.e. they always produce the same test set for the same system configuration. This paper reports a multi-way testing tool called FireEye, and provides an analytic and experimental evaluation of the two strategies. Copyright © 2007 John Wiley & Sons, Ltd.
منابع مشابه
Anatomy of the Tree Based Strategy for High Strength Interaction Testing
The amount of resources consumed for a complete and exhaustive testing becomes unreasonable and unaffordable. While it is vital to assure the quality and the reliability of any system, it is impossible to do an exhaustive testing due to the huge number of possible combinations. To bring a balance between exhaustive testing and lack of testing combinatorial interactions testing has been adopted....
متن کاملAnatomy of the Parallel Tree Based Strategy for High Strength Interaction Testing
Software and hardware testers concentrate on how to minimize the time involved in testing at the same time to ensure that the system is also tested well and made acceptable. This paper has enhanced and explained in details our previous strategy “A Tree Based Strategy for Test Data Generation and Cost Calculation for Pairwise Combinatorial Interaction Testing” to work effectively in parallel and...
متن کاملRandom vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network
This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers...
متن کاملConstruction of Mixed Covering Arrays of strengths 2 through 6 Using a Tabu Search Approach
The development of a new software system involves extensive tests of the software functionality in order to identify possible failures. Also, a software system already built requires a fine tuning of its configurable options to give the best performance in the environment where it is going to work. Both cases require a finite set of tests that avoids testing all the possible combinations (which...
متن کاملTest Sequence Generation from Classification Trees using Multi-agent Systems
The combinatorial test design and combinatorial interaction testing are well studied topics. For the generation of dynamic test sequences from a formal specification of combinatorial problems, there has not been much work yet. The classification tree method implements aspects from the field of combinatorial testing. We will extend the classification tree by additional information to allow the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Softw. Test., Verif. Reliab.
دوره 18 شماره
صفحات -
تاریخ انتشار 2008